Optimal Scheduling for Real time Parallel Computer Systems

نویسندگان

  • Leyuan Shi
  • Phillip Q Hwang
چکیده

Abstract We will describe our ongoing work in theWe will describe our ongoing work in the eld of optimal scheduling for real time systems We are primarily concerned with optimal task allocation and job scheduling for parallel computer systems Many real time task allocation and job scheduling problems are proven to be NP hard Recently we proposed a random ized optimization framework for e ciently solving such NP hard problems The proposed method the Nested Partitions NP method has been proved to converge to global optimal solutions and it is also highly matched to emerging massively parallel processing capabilities

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Scheduling of CHP-based Microgrid Under Real-Time Demand Response Program

Microgrid (MG) is considered as a feasible solution to integrate the distributed energy sources. In this paper, optimal scheduling of a grid-connected MG is investigated considering different power sources as combined heat and power (CHP) units, only power and heat generating units, and battery storage systems. Two different feasible operating regions are considered for the CHP units. In additi...

متن کامل

A Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study

This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...

متن کامل

17th IEEE Real-Time Systems Symposium: Work in Progress Sessions

Abstract We will describe our ongoing work in theWe will describe our ongoing work in the eld of optimal scheduling for real time systems We are primarily concerned with optimal task allocation and job scheduling for parallel computer systems Many real time task allocation and job scheduling problems are proven to be NP hard Recently we proposed a random ized optimization framework for e cientl...

متن کامل

Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems

Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...

متن کامل

A new Shuffled Genetic-based Task Scheduling Algorithm in Heterogeneous Distributed Systems

Distributed systems such as Grid- and Cloud Computing provision web services to their users in all of the world. One of the most important concerns which service providers encounter is to handle total cost of ownership (TCO). The large part of TCO is related to power consumption due to inefficient resource management. Task scheduling module as a key component can has drastic impact on both user...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996